A note on "Single-machine scheduling with general learning functions"
نویسندگان
چکیده
The recent paper ‘‘Single-machine scheduling with general learning functions’’ (Wang [1]) addresses the single-machine scheduling problems with a sum-of-processing-times-based learning effect. The author showed that that the shortest processing time (SPT) rule is optimal for the sum of completion times square minimization problem. He also showed by examples that the optimal schedule for the classical version of the problem is not optimal in the presence of a sum-ofprocessing-times-based learning effect for the following three objective functions: the weighted sum of completion times, the maximum lateness and the number of tardy jobs. But for some special cases, he proved that the weighted shortest processing time (WSPT) rule, the earliest due date (EDD) rule and Moore’s algorithm can construct an optimal schedule for the problem to minimize these objective functions, respectively. In this note we will give a counter-example to show the incorrectness of some results in Wang [1]. We shall follow the notations and terminologies given in Wang [1]. There are given a single machine and n independent and non-preemptive jobs that are immediately available for processing. The machine can handle one job at a time and preemption is not allowed. Let pj be the normal processing time of job j and p[k] the normal processing time of a job if it is scheduled in the kth position in a sequence. Associated with each job j (j = 1, 2, . . . , n) is a due-date dj. Let pj,r be the processing time of job j if it is scheduled in position r in a sequence. Then
منابع مشابه
Solving the Single Machine Problem with Quadratic Earliness and Tardiness Penalties
Nowadays, scheduling problems have a considerable application in production and service systems. In this paper, we consider the scheduling of n jobs on a single machine assuming no machine idleness, non-preemptive jobs and equal process times. In many of previous researches, because of the delivery dalays and holding costs, earliness and tardiness penalties emerge in the form of linear combin...
متن کاملLearning-Based Energy Management System for Scheduling of Appliances inside Smart Homes
Improper designs of the demand response programs can lead to numerous problems such as customer dissatisfaction and lower participation in these programs. In this paper, a home energy management system is designed which schedules appliances of smart homes based on the user’s specific behavior to address these issues. Two types of demand response programs are proposed for each house which are sh...
متن کاملTwo-stage fuzzy-stochastic programming for parallel machine scheduling problem with machine deterioration and operator learning effect
This paper deals with the determination of machine numbers and production schedules in manufacturing environments. In this line, a two-stage fuzzy stochastic programming model is discussed with fuzzy processing times where both deterioration and learning effects are evaluated simultaneously. The first stage focuses on the type and number of machines in order to minimize the total costs associat...
متن کاملMinimizing the Number of Tardy Jobs in the Single Machine Scheduling Problem under Bimodal Flexible and Periodic Availability Constraints
In single machine scheduling problems with availability constraints, machines are not available for one or more periods of time. In this paper, we consider a single machine scheduling problem with flexible and periodic availability constraints. In this problem, the maximum continuous working time for each machine increases in a stepwise manner with two different values allowed. Also, the durati...
متن کاملSingle-machine scheduling considering carryover sequence-dependent setup time, and earliness and tardiness penalties of production
Production scheduling is one of the very important problems that industry and production are confronted with it. Production scheduling is often planned in the industrial environments while productivity in production can improve significantly the expansion of simultaneous optimization of the scheduling plan. Production scheduling and production are two areas that have attracted much attention in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Mathematics with Applications
دوره 61 شماره
صفحات -
تاریخ انتشار 2011